Fast Heuristics for the Maximum Feasible Subsystem Problem
نویسندگان
چکیده
منابع مشابه
Fast Heuristics for the Maximum Feasible Subsystem Problem
Given an infeasible set of linear constraints, finding the maximum cardinality feasible subsystem is known as the maximum feasible subsystem problem. This problem is known to be NP-hard, but has many practical applications. This paper presents improved heuristics for solving the maximum feasible subsystem problem that are significantly faster than the original, but still highly accurate. (Linea...
متن کاملBranch-and-Cut for the Maximum Feasible Subsystem Problem
This paper presents a branch-and-cut algorithm for the NPhard maximum feasible subsystem problem: For a given infeasible linear inequality system, determine a feasible subsystem containing as many inequalities as possible. The complementary problem, where one has to remove as few inequalities as possible in order to make the system feasible, can be formulated as a set covering problem. The rows...
متن کاملOn the maximum feasible subsystem problem, IISs and IIS-hypergraphs
We consider the MAX FS problem: For a given infeasible linear system Ax ≤ b, determine a feasible subsystem containing as many inequalities as possible. This problem, which is NP-hard and also difficult to approximate, has a number of interesting applications in a wide range of fields. In this paper we examine structural and algorithmic properties of MAX FS and of Irreducible Infeasible Subsyst...
متن کاملA two-phase relaxation-based heuristic for the maximum feasible subsystem problem
We consider the maximum feasible subsystem problem in which, given an infeasible system of linear inequalities, one wishes to determine a largest feasible subsystem. The focus is on the version with bounded variables that naturally arises in several fields of application. To tackle this NP-hard problem, we propose a simple but efficient two-phase relaxation-based heuristic. First a feasible sub...
متن کاملOn the approximability of the maximum feasible subsystem problem with 0/1-coefficients
Given a system of constraints `i ≤ ai x ≤ ui, where ai ∈ {0, 1}, and `i, ui ∈ R+, for i = 1, . . . ,m, we consider the problem Mrfs of finding the largest subsystem for which there exists a feasible solution x ≥ 0. We present approximation algorithms and inapproximability results for this problem, and study some important special cases. Our main contributions are : 1. In the general case, where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2001
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.13.3.210.12632